#pragma GCC optimize(2, "Ofast", "inline")
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <algorithm>
#define endl '\n'
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define int128 __int128_t
using namespace std;

// 已知
int n, a[111], k;
// 未知
int cnt = 0;

signed main()
{
    cin.tie(0)->ios::sync_with_stdio(false);
    cin >> n;
    for (int i = 0;i < n;++i)
    {
        cin >> a[i];
    }
    cin >> k;
    for (int i = 0;i < n;++i)
    {
        cnt += (a[i] >= k);
    }
    cout << cnt;
    return 0;
}